Ideal denoising within a family of tree-structured wavelet estimators
نویسندگان
چکیده
منابع مشابه
Ideal denoising within a family of tree-structured wavelet estimators
Abstract: We focus on the performances of tree-structured wavelet estimators belonging to a large family of keep-or-kill rules, namely the Vertical Block Thresholding family. For each estimator, we provide the maximal functional space (maxiset) for which the quadratic risk reaches a given rate of convergence. Following a discussion on the maxiset embeddings, we identify the ideal estimator of t...
متن کاملDenoising of multicomponent images using wavelet least-squares estimators
In this paper, we study denoising of multicomponent images. The presented procedures are spatial wavelet-based denoising techniques, based on Bayesian leastsquares optimization procedures, using prior models for the wavelet coefficients that account for the correlations between the spectral bands. We analyze three mixture priors: Gaussian scale mixture models, Bernoulli-Gaussian mixture models ...
متن کاملImage Denoising Using Tree-based Wavelet Subband Correlations and Shrinkage
In this paper we describe new methods of denoising images which combine wavelet shrinkage with properties related to the statistics of quad-trees of wavelet transform values for natural images. They are called Tree-Adapted Wavelet Shrinkage (TAWS) methods. The shift-averaged version of TAWS produces denoisings which are comparable to state of the art denoising methods, such as cycle-spin thresh...
متن کاملSAR image data compression using a tree-structured wavelet transform
SAR image compression is very important in reducing the costs of data storage and transmission in relatively slow channels. In this paper, we propose a compression scheme driven by texture analysis, homogeneity mapping and speckle noise reduction within the wavelet framework. The image compressibility and interpretability are improved by incorporating speckle reduction into the compression sche...
متن کاملA Structured Family of Clustering and Tree Construction Methods
A cluster A is an Apresjan cluster if every pair of objects within A is more similar than either is to any object outside A. The criterion is intuitive, compelling, but often too restrictive for applications in classification. We therefore explore extensions of Apresjan clustering to a family of related hierarchical clustering methods. The extensions are shown to be closely connected with the w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Statistics
سال: 2011
ISSN: 1935-7524
DOI: 10.1214/11-ejs628